Deterministic Construction of RIP Matrices in Compressed Sensing from Constant Weight Codes
نویسندگان
چکیده
The expicit restricted isometry property (RIP) measurement matrices are needed in practical application of compressed sensing in signal processing. RIP matrices from Reed-Solomon codes, BCH codes, orthogonal codes, expander graphs have been proposed and analysised. On the other hand binary constant weight codes have been studied for many years and many optimal or near-optimal small weight and ditance constant weight codes have been determined. In this paper we propose a new deterministic construction of RIP measurement matrices in compressed sensing from binary contant weight codes. The sparse orders and the number of budged rows in the new constant-weight-code-based RIP matrices can be arbitrary. These contant-weight-code based RIP matrices have better parameters compared with the DeVore RIP matrices when the sizes are small.
منابع مشابه
Explicit RIP Matrices in Compressed Sensing from Algebraic Geometry
Compressed sensing was proposed by E. J. Candés, J. Romberg, T. Tao, and D. Donoho for efficient sampling of sparse signals in 2006 and has vast applications in signal processing. The expicit restricted isometry property (RIP) measurement matrices are needed in practice. Since 2007 R. DeVore, J. Bourgain et al and R. Calderbank et al have given several deterministic cosntrcutions of RIP matrice...
متن کاملNew Construction of Deterministic Compressed Sensing Matrices via Singular Linear Spaces over Finite Fields
As an emerging approach of signal processing, not only has compressed sensing (CS) successfully compressed and sampled signals with few measurements, but also has owned the capabilities of ensuring the exact recovery of signals. However, the above-mentioned properties are based on the (compressed) sensing matrices. Hence the construction of sensing matrices is the key problem. Compared with the...
متن کاملDeterministic Construction of Compressed Sensing Matrices using BCH Codes
In this paper we introduce deterministic m×n RIP fulfilling ±1 matrices of order k such that log m log k ≈ log(log2 n) log(log2 k) . The columns of these matrices are binary BCH code vectors that their zeros are replaced with −1 (excluding the normalization factor). The samples obtained by these matrices can be easily converted to the original sparse signal; more precisely, for the noiseless sa...
متن کاملWhat Is... a Rip Matrix?
RIP matrices– shorthand for matrices which satisfy the restricted isometry property– appeared as a byproduct of Compressed Sensing; a method discovered by D. Donoho, E. Candès and T. Tao in 2004 with several applications in computer science. Besides their real world application, RIP matrices are interesting mathematical objects because, on the one hand, a random matrix has a negligible probabil...
متن کاملDeterministic Compressive Sensing with Groups of Random Variables
Compressed Sensing aims to capture attributes of a sparse signal using very few measurements. Candès and Tao showed that random matrices satisfy the Restricted Isometry Property or RIP property with high probability. They showed that this condition is sufficient for sparse reconstruction and that random matrices, where the entries are generated by an iid Gaussian or Bernoulli process, satisfy t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1506.02568 شماره
صفحات -
تاریخ انتشار 2015